LEDA-SM Extending LEDA to Secondary Memory
نویسندگان
چکیده
During the last years, many software libraries for in-core computation have been developed. Most internal memory algorithms perform very badly when used in an external memory setting. We introduce LEDA-SM that extends the LEDA-library [22] towards secondary memory computation. LEDA-SM uses I/O-efficient algorithms and data structures that do not suffer from the so called I/O bottleneck. LEDA is used for in-core computation. We explain the design of LEDA-SM and report on performance results.
منابع مشابه
LEDA-SM: external memory algorithms and data structures in theory and practice
Data to be processed is getting larger and larger. Nowadays, it is necessary to store these huge amounts of data in external memory (mostly hard disks), as their size exceeds the internal, main memory of today’s computers. These large amounts of data pose different requirements to algorithms and data structures. Many existing algorithms and data structures are developed for the RAM model [AHU74...
متن کاملExact Computation with leda_real - Theory and geometric Applications
The number type leda real provides exact computation for a subset of real algebraic numbers: Every integer is a leda real, and leda reals are closed under the basic arithmetic operations +,−, ∗, / and k-th root operations. leda reals guarantee correct results in all comparison operations. The number type is available as part of the leda C++ software library of efficient data types and algorithm...
متن کاملGeometric Computing with CGAL and LEDA
LEDA and CGAL are platforms for combinatorial and geometric computing. We discuss the use of LEDA and CGAL for geometric computing and show that they provide a unique framework for exact, efficient and convenient geometric computing.
متن کاملMultiparadigm data structures in Leda
Multiparadigm programming is a term used to describe a style of software development that makes use of facilities originally designed in support of a number of di erent programming language paradigms. In this paper we illustrate our conception of multiparadigm programming, by describing how various data structures can be implemented in the programming language Leda. Leda is a strongly-typed com...
متن کاملThe LEDA Platform of Combinatorial and Geometric Computing
Abst rac t . We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We ref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999